computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
851	On Accurate and Efficient Statistical Counting in Sensor-Based Surveillance Systems Shuo Guo§ , Tian He§ , Mohamed F. Mokbel§, John A. Stankovic† and Tarek F. Abdelzaher‡ § Department of Computer Science and Eng Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2009-09-29 10:22:40 Computational complexity theory Algorithm
852	c 2009 International Press COMMUNICATIONS IN INFORMATION AND SYSTEMS Vol. 9, No. 4, pp, 2009 Add to Reading List Source URL: www.ims.cuhk.edu.hk Language: English - Date: 2009-11-16 19:28:18 Computational complexity theory Chordal graph Tree PP B-tree Time complexity Theoretical computer science Graph theory Applied mathematics
853	On Accurate and Efficient Statistical Counting in Sensor-Based Surveillance Systems S. Guo,a , T. Hea , M. F. Mokbela, J. A. Stankovicb, T. F. Abdelzaherc a Department of Computer Science and Engineering, University of Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2010-10-09 13:42:58 Computational complexity theory Factorial Algorithm PP Mathematics Theoretical computer science Combinatorics
854	IEEE TRANSACTIONS ON COMPUTERS, VOL. 54, NO. 9, SEPTEMBER 2005 Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 21:57:03 Analysis of algorithms Switches Randomized algorithm Logic gate PP Network switch Time complexity Theoretical computer science Computational complexity theory Applied mathematics
855	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-06-09 11:30:44 Computational complexity theory Parameterized complexity Analysis of algorithms Michael Fellows Kernelization Outerplanar graph Clique Connectivity Tree decomposition Graph theory Theoretical computer science Mathematics
856	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
857	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
858	Microsoft Word - GZBriefing paper - Social problems and impact2011.doc Add to Reading List Source URL: www.csi.edu.au Language: English - Date: 2014-12-09 22:56:07 Mind Psychology Holism Systems Positive psychology Complexity Computational complexity theory Intelligence quotient Social complexity Science Complex systems theory Popular psychology
859	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
860	Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:27 Parameterized complexity Analysis of algorithms Time complexity NP-complete problems Algorithm Theoretical computer science Applied mathematics Computational complexity theory